package 蓝桥.模拟赛;

import java.util.Scanner;

public class Main8 {
    public static void main(String[] args) {
        // 子序列
        Scanner in = new Scanner(System.in);
        String s = in.next();
        String t = "LANQIAO";

        int m = s.length();
        int n = t.length();
        // dp[i][j]表示s的前i个字符和t的前j个字符的子序列个数
        int[][] dp = new int[m+1][n+1];
        for (int i = 0; i <= m; i++) {
            dp[i][0] = 1;
        }
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if(s.charAt(i-1)==t.charAt(j-1)){
                    dp[i][j] = dp[i-1][j-1] + dp[i-1][j];
                }else{
                    dp[i][j] = dp[i-1][j];
                }
            }
        }
        if(dp[m][n]==0){
            System.out.println("NO");
        }else{
            System.out.println("YES");
        }

    }
}
